Data structures and simulation algorithms for flow-shop scheduling with resource availability constraints

Flow-shop scheduling problems are classic examples of multi-resource and multi-operation optimization problems. This paper demonstrates our model simulation for solving with resource availability constraints to minimize makespan. Working hours, transfer times setup taken into account. hours could be interpreted in two ways. In the first option, operations must fit a single available time slot. second cut across multiple slots. We propose algorithm that accounts both scenarios used any permutation-based exact, heuristic, or search algorithm.